Linear Programming Versus Convex Quadratic Programming for the Module Allocation Problem
نویسنده
چکیده
We consider the Module Allocation Problem with Non-Uniform communication costs (MAPNU), where a set of program modules must be assigned to a set of processors. The optimal assignment minimizes the sum of execution costs and communication costs between modules. This problem is naturally formulated as a quadratic 0-1 problem with linear constraints. In this paper, we compare two exact solution methods for this problem. The first method is based on linear programming and Mixed Integer Linear Programming. The second one uses semidefinite programming and Mixed Integer Quadratic Programming. Both of these methods are easy to implement by use of available optimization software. We describe each of these methods and carry out a comparative computational work for instances of MAPNU.
منابع مشابه
FGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملA new approach for solving fuzzy multi-objective quadratic programming of water resource allocation problem
متن کامل
A NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کامل